Transition Diagram Systems and Normal Form Algorithms
نویسندگان
چکیده
We investigate the complexity of a variety of normal-form transformations for transition diagram systems, which are a parsing view of extended context-free grammars. A transition diagram system is a nite collection of nite-state machines each of which is labeled with a unique nonterminal symbol. The study is motivated by the implementation project GraMa which will provide a C++ toolkit for the symbolic manipulation of context-free objects just as Grail does for regular objects. We provide both new algorithms and eecient implementations of them.
منابع مشابه
Algorithms for Drawing Media
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two principles: embedding the state transition graph in a low-dimensional integer lattice and projecting the lattice onto the plane, or drawing the medium as a planar graph with centrally symmetric faces.
متن کاملAround Context-Free Grammars - a Normal Form, a Representation Theorem, and a Regular Approximation
We introduce a normal form for context-free grammars, called Dyck normal form. This is a syntactical restriction of the Chomsky normal form, in which the two nonterminals occurring on the right-hand side of a rule are paired nonterminals. This pairwise property allows to define a homomorphism from Dyck words to words generated by a grammar in Dyck normal form. We prove that for each context-fre...
متن کاملNORMAL FORM SOLUTION OF REDUCED ORDER OSCILLATING SYSTEMS
This paper describes a preliminary investigation into the use of normal form theory for modelling large non-linear dynamical systems. Limit cycle oscillations are determined for simple two-degree-of-freedom double pendulum systems. The double pendulum system is reduced into its centre manifold before computing normal forms. Normal forms are obtained using a period averaging method which is appl...
متن کاملOBDD-based function decomposition: algorithms and implementation
This paper presents algorithms for disjunctive and nondisjunctive decomposition of Boolean functions and Boolean methods for identifying common subfunctions from multiple Boolean functions. Ordered Binary Decision Diagrams are used to represent and manipulate Boolean functions so that the proposed methods can be implemented concisely. These techniques are applied to the synthesis of look-up tab...
متن کاملNear Pole Polar Diagram of Points and its Duality with Applications
In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998